A Convex Combination between Two Different Search Directions of Conjugate Gradient Method and Application in Image Restoration

نویسندگان

چکیده

The conjugate gradient is a useful tool in solving large- and small-scale unconstrained optimization problems. In addition, the method can be applied many fields, such as engineering, medical research, computer science. this paper, convex combination of two different search directions proposed. new satisfies sufficient descent condition convergence analysis. Moreover, formula properties with property related to Hestenes–Stiefel formula. numerical results show that direction outperforms both directions, making it between them. result includes number iterations, function evaluations, central processing unit time. Finally, we present some examples about image restoration an application proposed method.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Iterative Conjugate Gradient Regularization Method for Image Restoration

Image restoration is an ill-posed inverse problem, which has been introduced the regularization method to suppress over-amplification. In this paper, we propose to apply the iterative regularization method to the image restoration problem and present a nested iterative method, called iterative conjugate gradient regularization method. Convergence properties are established in detail. Based on [...

متن کامل

Application of frames in Chebyshev and conjugate gradient methods

‎Given a frame of a separable Hilbert space $H$‎, ‎we present some‎ ‎iterative methods for solving an operator equation $Lu=f$‎, ‎where $L$ is a bounded‎, ‎invertible and symmetric‎ ‎operator on $H$‎. ‎We present some algorithms‎ ‎based on the knowledge of frame bounds‎, ‎Chebyshev method and conjugate gradient method‎, ‎in order to give some‎ ‎approximated solutions to the problem‎. ‎Then we i...

متن کامل

Line search fixed point algorithms based on nonlinear conjugate gradient directions: application to constrained smooth convex optimization

This paper considers the fixed point problem for a nonexpansive mapping on a real Hilbert space and proposes novel line search fixed point algorithms to accelerate the search. The termination conditions for the line search are based on the well-known Wolfe conditions that are used to ensure the convergence and stability of unconstrained optimization algorithms. The directions to search for fixe...

متن کامل

A conjugate gradient based method for Decision Neural Network training

Decision Neural Network is a new approach for solving multi-objective decision-making problems based on artificial neural networks. Using inaccurate evaluation data, network training has improved and the number of educational data sets has decreased. The available training method is based on the gradient decent method (BP). One of its limitations is related to its convergence speed. Therefore,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Problems in Engineering

سال: 2021

ISSN: ['1026-7077', '1563-5147', '1024-123X']

DOI: https://doi.org/10.1155/2021/9941757